The Second Rewrite Engines Competition
نویسندگان
چکیده
The Second Rewrite Engines Competition (REC) was celebrated as part of the 7th Workshop on Rewriting Logic and its Applications (WRLA 2008). In this edition of the competition participated five systems, namely ASF+SDF, Maude, Stratego/XT, TermWare, and Tom. We explain here how the competition was organized and conducted, and present its main results and conclusions.
منابع مشابه
The Third Rewrite Engines Competition
This paper presents the main results and conclusions of the Third Rewrite Engines Competition (REC III). This edition of the competition took place as part of the 8th Workshop on Rewriting Logic and its Applications (WRLA 2010), and the systems ASF+SDF, Maude, Stratego/XT, Tom, and TXL participated in it.
متن کاملTowards Effectively Eliminating Conditional Rewrite Rules
Conditional rewrite rules are notorious for being difficult to implement in rewrite engines. This is because, like in the case of function calls in programming language implementations, rewrite engines need to ”freeze” the current rewriting environment and to create a new one in which the condition is reduced. Stacking these rewriting environments efficiently can easily become a nontrivial task...
متن کاملIntegrating SQL Databases with Content-Specific Search Engines
In recent years, database research and product development activities have focused on support for non-traditional data types, such as text or multi-media documents. This paper describes an approach of coupling SQL databases and content-specific search engines, such as fulltext retrieval engines, in an efficient manner. It is based on a query rewrite scheme that exploits so-called table function...
متن کاملBPMN 2.0 Execution Semantics Formalized as Graph Rewrite Rules
This paper presents a formalization of a subset of the BPMN 2.0 execution semantics in terms of graph rewrite rules. The formalization is supported by graph rewrite tools and implemented in one of these tools, called GrGen. The benefit of formalizing the execution semantics by means of graph rewrite rules is that there is a strong relation between the execution semantics rules that are informal...
متن کاملFrom Conditional to Unconditional Rewriting
An automated technique to translate conditional rewrite rules into unconditional ones is presented, which is suitable to implement, or compile, conditional rewriting on top of much simpler and easier to optimize unconditional rewrite systems. An experiment performed on world’s fastest conditional rewriting engines shows that speedups for conditional rewriting of an order of magnitude can alread...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 238 شماره
صفحات -
تاریخ انتشار 2009